A symmetric Diophantine equation involving biquadrates
نویسندگان
چکیده
منابع مشابه
A Binomial Diophantine Equation
following result. THEOREM 1. The only (n,m)eZ with n^2 and m5=4 satisfying © = ( 7 ) a r e {n> m)=(2> 4)> (6> 6)> and (21> Our binomial diophantine equation represents an elliptic curve, since it can be rewritten as a quartic polynomial being a square. Indeed, on putting u = 2/i 1 and v = 2m 3, we see at once that Theorem 1 follows from the following result. THEOREM 2. The only (u, v) e Z with ...
متن کاملOn a Diophantine Equation
In this note, we mainly obtain the equation x2m − yn = z2 have finite positive integer solutions (x, y, z,m, n) satisfying x > y be two consecutive primes. Mathematics Subject Classification: 11A41; 11D41
متن کاملAbout a Diophantine Equation
In this paper we study the Diophantine equation x −6xy +5y = 16Fn−1Fn+1, where (Fn) n≥0 is the Fibonacci sequence and we find a class of such equations having solutions which are determined.
متن کاملRandom approximation of a general symmetric equation
In this paper, we prove the Hyers-Ulam stability of the symmetric functionalequation $f(ph_1(x,y))=ph_2(f(x), f(y))$ in random normed spaces. As a consequence, weobtain some random stability results in the sense of Hyers-Ulam-Rassias.
متن کاملSymmetric Modular Diophantine Inequalities
In this paper we study and characterize those Diophantine inequalities axmod b ≤ x whose set of solutions is a symmetric numerical semigroup. Given two integers a and b with b = 0 we write a mod b to denote the remainder of the division of a by b. Following the notation used in [8], a modular Diophantine inequality is an expression of the form ax mod b ≤ x. The set S(a, b) of integer solutions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notes on Number Theory and Discrete Mathematics
سال: 2018
ISSN: 1310-5132,2367-8275
DOI: 10.7546/nntdm.2018.24.2.140-144